Coplanar Qca Adders for Arithmetic Circuits
نویسندگان
چکیده
منابع مشابه
QCA Circuits for Robust Coplanar Crossing
In this paper, different circuits of Quantum-dot Cellular Automata (QCA) are proposed for the so-called coplanar crossing. Coplanar crossing is one of the most interesting features of QCA because it allows for mono-layered interconnected circuits, whereas CMOS technology needs different levels of metalization. However, the characteristics of the coplanar crossing make it prone to malfunction du...
متن کاملQca-based Nano Circuits Design
In order to design large digital circuits using Quantum-Dot Cellular Automata(QCA) cells, CAD tools and automated design methodology for QCA circuits are essential. This paper presents a QCA circuits design methodology based on traditional CMOS circuits design flow. This QCA circuits design methodology utilizes the current CMOS circuits design tools such as HSPICE and Synopsys Design Compiler. ...
متن کاملFull Adders for High-Speed/Low power Arithmetic Circuits: A Comparison
In this paper, interesting full adder circuits are reviewed and compared concerning speed, power consumption, and silicon area. A modified full adder is also investigated by combining hybrid logics, namely, pass transistor logic and branch based logic. This architecture uses two independent parts to generate SUM and carry signals. The results show that ultra low power evolution, very small prop...
متن کاملDesign and Test of New Robust QCA Sequential Circuits
One of the several promising new technologies for computing at nano-scale is quantum-dot cellular automata (QCA). In this paper, new designs for different QCA sequential circuits are presented. Using an efficient QCA D flip-flop (DFF) architecture, a 5-bit counter, a novel single edge generator (SEG) and a divide-by-2 counter are implemented. Also, some types of oscillators, a new edge-t...
متن کاملAlgorithms for Arithmetic Circuits
Given a multivariate polynomial f(X) ∈ F[X] as an arithmetic circuit we would like to efficiently determine: 1. Identity Testing. Is f(X) identically zero? 2. Degree Computation. Is the degree of the polynomial f(X) at most a given integer d . 3. Polynomial Equivalence. Upto an invertible linear transformation of its variables, is f(X) equal to a given polynomial g(X). The algorithmic complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.4.19597